Computing the Acceptability Semantics
نویسندگان
چکیده
We present a proof theory and a proof procedure for non-monotonic reasoning based on the acceptability semantics for logic programming , formulated in an argumentation framework. These proof theory and procedure are deened as generalisations of corresponding proof theories and procedures for the stable theory and preferred extension semantics. In turn, these can be seen as generalisations of the Eshghi-Kowalski abductive procedure for logic programming.
منابع مشابه
Credulous Acceptability in Probabilistic Abstract Argumentation: Complexity Results
Probabilistic abstract argumentation combines Dung’s abstract argumentation framework with probability theory in order to model uncertainty in argumentation. In this setting, we address the fundamental problem of computing the probability that an argument is (credulously) acceptable according to a given semantics. Specifically, we focus on the most popular semantics (i.e., admissible, stable, s...
متن کاملGRAFIX: a Tool for Abstract Argumentation
GRAFIX is a graphical tool for handling abstract argumentation graphs. GRAFIX allows the edition and the presentation of argumentation graphs (or sets of graphs), and the execution of some “predefined treatments” (called “server treatments”) on the current graph(s) such as, for instance, computing various acceptability semantics, or computing the strength of arguments. GRAFIX also allows the us...
متن کاملAxiomatic Foundations of Acceptability Semantics
An argument is a reason or justification of a claim. It has an intrinsic strength and may be attacked by other arguments. Hence, the evaluation of its overall strength becomes mandatory, especially for judging the reliability of its claim. Such an evaluation is done by acceptability semantics. The aim of this paper is to set up the foundations of acceptability semantics. Foundations are importa...
متن کاملRobust Semantics for Argumentation Frameworks
We suggest a so-called “robust” semantics for a model of argumentation which represents arguments and their interactions, called “argumentation frameworks”. We study a variety of additional definitions of acceptability of arguments; we explore the properties of these definitions; we describe their inter-relationships: e.g. robust models can be characterized using the minimal (well-founded) mode...
متن کاملExtending Argumentation to Make Good Decisions
Argumentation has been acknowledged as a powerful mechanism for automated decision making. In this context several recent works have studied the problem of accommodating preference information in argumentation. The majority of these studies rely on Dung’s abstract argumentation framework and its underlying acceptability semantics. In this paper we show that Dung’s acceptability semantics, when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995